منابع مشابه
An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملA Multipreconditioned Conjugate Gradient Algorithm
We propose a generalization of the conjugate gradient method that uses multiple preconditioners, combining them automatically in an optimal way. The derivation is described in detail, and analytical observations are made. A short recurrence relation does not hold in general for this new method, but in at least one case such a relation is satisfied: for two symmetric positive definite preconditi...
متن کاملAutomatic Parallelization of the Conjugate Gradient Algorithm
The conjugate gradient (CG) method is a popular Krylov space method for solving systems of linear equations of the form Ax = b, where A is a symmetric positive-deenite matrix. This method can be applied regardless of whether A is dense or sparse. In this paper, we show how restructuring compiler technology can be applied to transform a sequential, dense matrix CG program into a parallel, sparse...
متن کاملConjugate Gradient Algorithm with Data Selective Updating
This paper applies data selective updating to the Modified Conjugate Gradient algorithm. In search for a new conjugategradient-like filtering algorithm, two different approaches are developed: the first one results in the recently proposed set-membership affine projection (SM-AP) algorithm and the second one reduces the computational requirements of the modified congujate gradient algorithm whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2006
ISSN: 1026-0226,1607-887X
DOI: 10.1155/ddns/2006/52682